A Gauss-Seidel projection method with the minimal number of updates for the stray field in micromagnetics simulations

نویسندگان

چکیده

<p style='text-indent:20px;'>Magnetization dynamics in magnetic materials is often modeled by the Landau-Lifshitz equation, which solved numerically general. In micromagnetics simulations, computational cost relies heavily on time-marching scheme and evaluation of stray field. this work, we propose a new method, dubbed as GSPM-BDF2, combining advantages Gauss-Seidel projection method (GSPM) second-order backward differentiation formula (BDF2). Like GSPM, first-order accurate time space, it unconditionally stable with respect to damping parameter. Remarkably, GSPM-BDF2 updates field only once per step, leading an efficiency improvement about <inline-formula><tex-math id="M1">\begin{document}$ 60\% $\end{document}</tex-math></inline-formula> compared state-of-the-art GSPM for simulations. For Standard Problems #4 #5 from National Institute Standards Technology, reduces over popular software OOMMF id="M2">\begin{document}$ 82\% id="M3">\begin{document}$ 96\% $\end{document}</tex-math></inline-formula>, respectively. Thus, proposed provides more efficient choice simulations.</p>

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Gauss–Seidel Projection Method for Micromagnetics Simulations

The Gauss–Seidel projection method (GSPM) (Wang et al., J. Comp. Phys., vol. 171, pp. 357–372, 2001) is a simple, efficient, and unconditionally stable method for micromagnetics simulations. We present an improvement of the method for small values of the damping parameter. With the new method, we are able to carry out fully resolved simulations of the magnetization reversal process in the prese...

متن کامل

The Gauss-seidel Fast Affine Projection Algorithm

In this paper we propose a new stable Fast Affine Projection algorithm based on Gauss -Seidel iterations (GSFAP). We investigate its implementation using the logarithmic number system (LNS) and compare it with other two FAP algorithms. A method to simplify its implementation is also proposed. We show that the 32-bit or 20-bit LNS implementation of the GSFAP algorithm is superior to those of oth...

متن کامل

study of cohesive devices in the textbook of english for the students of apsychology by rastegarpour

this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...

A Review of Preconditioners for the Interval Gauss – Seidel Method

Interval Newton methods in conjunction with generalized bisection can form the basis of algorithms that find all real roots within a specified box X ⊂ Rn of a system of nonlinear equations F (X) = 0 with mathematical certainty, even in finite-precision arithmetic. In such methods, the system F (X) = 0 is transformed into a linear interval system 0 = F (M) + F′(X)(X̃ −M); if interval arithmetic i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete and Continuous Dynamical Systems-series B

سال: 2022

ISSN: ['1531-3492', '1553-524X']

DOI: https://doi.org/10.3934/dcdsb.2022002